393 Documenta Math. On Packing Spheres into Containers About Kepler’s Finite Sphere Packing Problem

Source URL: www.math.uiuc.edu

An Ant Colony Optimisation Algorithm for the Set Packing Problem Xavier GANDIBLEUX1,2 , Xavier DELORME2 and Vincent T’KINDT3 (1) LINA - Laboratoire d’Informatique de Nantes Atlantique Universite de Nantes 2 rue de la

Source URL: www.emse.fr

The sphere packing problem in dimension 8 Maryna S. Viazovska arXiv:1603.04246v1 [math.NT] 14 Mar 2016

Source URL: arxiv.org

MIC2005: The Sixth Metaheuristics International Conference ??-1 An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure

Source URL: www.emse.fr

International Journal on Computational Science & Applications (IJCSA) Vol.5,No.6, DecemberBIN PACKING PROBLEM: A LINEAR CONSTANT
SPACE -APPROXIMATION ALGORITHM 

Source URL: wireilla.com

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Source URL: resources.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Packing problems
• Operations research
• Approximation algorithms
• Knapsack problem
• Vertex cover
• Bin packing problem
• Hardness of approximation
• Algorithm

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Set cover problem
• Approximation algorithm
• Algorithm
• Analysis of algorithms
• Bin packing problem
• Vertex cover

Average-Case Analyses of First Fit and Random Fit Bin Packing Susanne Albers Michael Mitzenmachery Abstract

Source URL: www14.in.tum.de

• Mathematics
• Mathematical analysis
• Stochastic processes
• Probability
• Lemmas
• Bin packing problem
• Random walk
• Coupling
• Combinatorics

Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress

Source URL: www.daviddelaat.nl

• Mathematics
• Geometry
• Discrete geometry
• NP-complete problems
• Circle packing
• Conjectures
• Operations research
• Sphere packing
• Independent set
• Tammes problem
• Kepler conjecture
• Semidefinite programming